Parallel Computation of Delay Fault Probabilities
نویسندگان
چکیده
This paper presents an improved measure for the dynamic functionality of a logic circuit, called delay fault probability (DFP). The new measure reflects both the nominal delay of the paths and the fact that only few paths are critical for path delay fault testing. An efficient distributed algorithm for computing DFP is presented. The experimental results show that, in contrast to DFP, the conventional fault coverage is an inadequate criterion to assure the dynamic functionality of a circuit.
منابع مشابه
On Fault Probabilities and Yield Models for Analog VLSI Neural Networks
We investigate the estimation of fault probabilities and yield for analog VLSI implementations of neural computation. Our analysis is limited to structures that can be mapped directly onto silicon as truly distributed parallel processing systems. Our work improves on the framework suggested recently by Feltham and Maly [3] and is also applicable to analog or mixed analog/digital VLSI systems.
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملFault-tolerant Routing Algorithms based on Approximate Routable Probabilities for Hypercube Networks
Recently, research on parallel processing systems is very active, and many complex topologies have been proposed. One of the most popular topologies is a hypercube network. In this paper, we propose new fault-tolerant routing algorithms for hypercube networks based on approximate routable probabilities. The probability represents ability of routing to any node at a specific distance. Each node ...
متن کاملImproving the palbimm scheduling algorithm for fault tolerance in cloud computing
Cloud computing is the latest technology that involves distributed computation over the Internet. It meets the needs of users through sharing resources and using virtual technology. The workflow user applications refer to a set of tasks to be processed within the cloud environment. Scheduling algorithms have a lot to do with the efficiency of cloud computing environments through selection of su...
متن کاملFault-Tolerant Matrix Operations for Networks of Workstations Using Diskless Checkpointing
Networks of workstations (NOWs) offer a cost-effective platform for high-performance, long-running parallel computations. However, these computations must be able to tolerate the changing and often faulty nature of NOW environments. We present high-performance implementations of several fault-tolerant algorithms for distributed scientific computing. The fault-tolerance is based on diskless chec...
متن کامل